A Note on K-State Self-stabilization in a Ring with K=N
نویسندگان
چکیده
We show that, contrary to common belief, Dijkstra’s K-state mutual exclusion algorithm on a ring also stabilizes when the number K of states per process is one less than the number N + 1 of processes in the ring. We formalize the algorithm and verify the proof in PVS, based on Qadeer and Shankar’s work. We show that K = N is sharp by giving a counter-example for K = N − 1. ACM CCS
منابع مشابه
Almost Two State Self Stabilizing Synchronous Ring
A self stabilizing distributed system is a network of state machines which, regardless of its initial global state, once started will regain its consistency by itself in a nite number of steps. Two are the main issues in the design of a self-stabilizing system: stabilization time and memory requirements. In this paper we present an almost two state self stabilizing unidirectional system solving...
متن کاملThe Effects of Lumbar Stabilization Exercise Program Using Respiratory Resistance on Pain, Dysfunction, Psychosocial Factor, Respiratory Pressure in Female Patients in ’40s with Low Back Pain: Randomized Controlled Trial
Background. Middle-aged women are at risk of musculoskeletal disorders because of the decreased muscle mass and bone density caused by a decreased endocrine function. Objectives. This study investigated the effectiveness of a stabilization exercise using respiratory resistance on female patients in their 40s with low back pain. Methods. Forty-four female patients in their 40s with low back pa...
متن کاملLower bounds on the signed (total) $k$-domination number
Let $G$ be a graph with vertex set $V(G)$. For any integer $kge 1$, a signed (total) $k$-dominating functionis a function $f: V(G) rightarrow { -1, 1}$ satisfying $sum_{xin N[v]}f(x)ge k$ ($sum_{xin N(v)}f(x)ge k$)for every $vin V(G)$, where $N(v)$ is the neighborhood of $v$ and $N[v]=N(v)cup{v}$. The minimum of the values$sum_{vin V(G)}f(v)$, taken over all signed (total) $k$-dominating functi...
متن کاملDeterministic silence and self stabilizing leader election algorithm on id based ring
We present in this paper a deterministic silence and self stabilizing leader election algorithm on unidirectional id based rings which have a bound on their id values The id values of proces sors in a ring whose size is N have to be inferior to N k The size of communication registers required by the algorithm is constant The algorithm stabilizes in k N time keywords self stabilization leader el...
متن کاملCharacterization of $delta$-double derivations on rings and algebras
The main purpose of this article is to offer some characterizations of $delta$-double derivations on rings and algebras. To reach this goal, we prove the following theorem:Let $n > 1$ be an integer and let $mathcal{R}$ be an $n!$-torsion free ring with the identity element $1$. Suppose that there exist two additive mappings $d,delta:Rto R$ such that $$d(x^n) =Sigma^n_{j=1} x^{n-j}d(x)x^{j-1}+Si...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Nord. J. Comput.
دوره 12 شماره
صفحات -
تاریخ انتشار 2005